package leetcode;
/**
 * 题目：斐波纳契数列
 * 动态规划
 * 链接：https://leetcode.cn/problems/fibonacci-number/description/
 */
public class FibDP {
    public static void main(String[] args) {
        int n = 4;
        System.out.println(fibDP(n));
    }
    public static int fibDP(int n) {
        if (n == 0) {
            return 0;
        }
        if (n == 1) {
            return 1;
        }
        int[] dp = new int[n + 1];
        dp[0] = 0;
        dp[1] = 1;
        for (int i = 2; i <= n; i++) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n];
    }
}
